Dfg-forschergruppe \spc" Fakultt at F Ur Mathematik Parallelization of Multi-grid Methods Based on Domain Decomposition Ideas
نویسنده
چکیده
In the paper, the parallelization of multi-grid methods for solving second-order elliptic boundary value problems in two-dimensional domains is discussed. The parallelization strategy is based on a non-overlapping domain decomposition data structure such that the algorithm is well-suited for an implementation on a parallel machine with MIMD architecture. For getting an algorithm with a good parallel performance it is necessary to have as few communication as possible between the processors. In our implementation, communication is only needed within the smoothing procedures and the coarse-grid solver. The interpolation and restriction procedures can be performed without any communication. New variants of smoothers of Gauss-Seidel type having the same communication cost as Jacobi smoothers are presented. For solving the coarse-grid systems iterative methods are proposed that are applied to the corresponding Schur complement system. Three numerical examples, namely a Poisson equation, a magnetic eld problem, and a plane linear elasticity problem, demonstrate the eeciency of the parallel multi-grid algorithm.
منابع مشابه
Iterative Computation of the Smallest Singular Value and the Corresponding Singular Vectors of a Matrix
Technische Universit at Dresden Herausgeber: Der Rektor Iterative Computation of the Smallest Singular Value and the Corresponding Singular Vectors of a Matrix Hubert Schwetlick and Uwe Schnabel IOKOMO-06-97 December 1997 Preprint-Reihe IOKOMO der DFG-Forschergruppe Identi kation und Optimierung komplexer Modelle auf der Basis analytischer Sensitivitatsberechnungen an der Technischen Universi...
متن کاملAbstraction and Performance in the Design of Parallel Programs Der Fakultt at F Ur Mathematik Und Informatik Der Universitt at Passau Vorgelegte Zusammenfassung Der Verr Ooentlichungen Zur Erlangung Der Venia Legendi
متن کامل
A Generalized Inverse Iteration for Computing Simple Eigenvalues of Nonsymmetric Matrices
Technische Universit at Dresden Herausgeber: Der Rektor A Generalized Inverse Iteration for Computing Simple Eigenvalues of Nonsymmetric Matrices Hubert Schwetlick and Ralf L osche IOKOMO-07-97 December 1997 Preprint-Reihe IOKOMO der DFG-Forschergruppe Identi kation und Optimierung komplexer Modelle auf der Basis analytischer Sensitivitatsberechnungen an der Technischen Universitat Dresden ...
متن کاملA Highly Scalable Parallel Implementation of Balancing Domain Decomposition by Constraints
In this work we propose a novel parallelization approach of two-level balancing domain decomposition by constraints preconditioning based on overlapping of fine-grid and coarsegrid duties in time. The global set of MPI tasks is split into those that have fine-grid duties and those that have coarse-grid duties, and the different computations and communications in the algorithm are then re-schedu...
متن کاملThe Role of Active Vision in Exploring Growth, Transport, and Exchange Processes
The active vision paradigm plays a significant role in a recently established interdisciplinary research initiative (DFG Forschergruppe) at Heidelberg University. The goal of the Forschergruppe is to develop and apply advanced image sequence processing techniques to study key scientific questions in environmental sciences and biology that cannot be approached with conventional techniques. The F...
متن کامل